The Newton Bracketing Method for Convex Minimization
نویسندگان
چکیده
An iterative method for the minimization of convex functions f : R → R, called a Newton Bracketing (NB) method, is presented. The NB method proceeds by using Newton iterations to improve upper and lower bounds on the minimum value. The NB method is valid for n = 1, and in some cases for n > 1 (sufficient conditions given here). The NB method is applied to large scale Fermat–Weber location problems.
منابع مشابه
The Newton Bracketing method for the minimization of convex functions subject to affine constraints
The Newton Bracketing method [9] for the minimization of convex functions f : Rn → R is extended to affinely constrained convex minimization problems. The results are illustrated for affinely constrained Fermat–Weber location problems.
متن کاملApproximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The problem has a series-parallel structure, with the variables divided serially into n disjoint subsets, whose elements are considered in parallel. This special structure is exploited in two algorithms proposed here for the a...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملSolution of Elastoplastic Problems based on Moreau-Yosida Theorem
The quasi-static problem of elastoplasticity with isotropic hardening is considered, with particular emphasis on its numerical solution by means of a Newton-like method. The smoothness properties necessary for such method can be ensured by Moreau-Yosida’s theorem. After time discretization, the classical formulation of the elastoplastic problem is transformed to a minimization problem. The conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 21 شماره
صفحات -
تاریخ انتشار 2002